Qualitative properties of α-weighted scheduling policies
نویسندگان
چکیده
منابع مشابه
Qualitative properties of -weighted scheduling policies
We consider a switched network, a fairly general constrained queueing network model that has been used successfully to model the detailed packet-level dynamics in communication networks, such as input-queued switches and wireless networks. The main operational issue in this model is that of deciding which queues to serve, subject to certain constraints. In this paper, we study qualitative perfo...
متن کاملQualitative Properties of Α-fair Policies in Bandwidth-sharing Networks
We consider a flow-level model of a network operating under an α-fair bandwidth sharing policy (with α > 0) proposed by Roberts and Massoulié (2000). This is a probabilistic model that captures the long-term aspects of bandwidth sharing between users or flows in a communication network. We study the transient properties as well as the steady-state distribution of the model. In particular, for α...
متن کاملImpact of Qualitative and Quantitative errors of the job runtime estimation in backfilling based scheduling policies
Estimation or prediction accuracy in backfilling based policies it’s an important issue that has high impact on the system performance. However it’s not clear which is the required precision of such estimations, moreover it’s not clear which kind of errors are critical when scheduling the jobs that are queued in the local systems. In this paper we present a deeper analysis of the impact of the ...
متن کاملScheduling Policies : Single Servers
Our high-level goal is the development and implementation of algorithms which reduce power consumption in data centers by as much as 40%, while still meeting response time service-level objectives (typically in the form of 95%-tiles). We are motivated by the facts that: (i) the load in data centers varies by a factor of 2–4 during the course of a day, with servers only busy 20% of the time on a...
متن کاملRandomizing Dispatch Scheduling Policies
The factory is a complex dynamic environment and scheduling operations for such an environment is a challenging problem. In practice, dispatch scheduling policies are commonly employed, as they offer an efficient and robust solution. However, dispatch scheduling policies are generally myopic, and as such they are susceptible to sub-optimal decision-making. In this paper, we attempt to improve u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2010
ISSN: 0163-5999
DOI: 10.1145/1811099.1811067